A Fuzzy Algorithm of Peer Selection for P2P Streaming Media System Based on Gossip Transmission Protocol
نویسندگان
چکیده
The traditional Gossip protocol selects the neighbor nodes randomly. It does not consider the factors, such as the capacities of network transmission and node storage, which affect the network performance. It further causes the drawback of successful search ratio relatively lower, and also network transmission payloads have the characteristics of randomness. In this paper, to overcome those drawbacks of traditional Gossip protocol, a neighbor node selection algorithm has been studied, and various factors that may affect the neighbor node selection have been analyzed in P2P networks. A new neighbor node selection policy has been proposed, which is a reliable Gossip message transmission Protocol based on fuzzy theory. Empirical simulation experiments with various data analysis have demonstrated the improvement of efficiency of the proposed strategy on node selection and correctness of the proposed algorithm in P2P networks.
منابع مشابه
GGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کاملAchievability of an Incentive Mechanism for Gossip based Peer-to-Peer Streaming
We provide a generic achievability argument for incentives in gossip based p2p streaming by proving that after coupling a randomized optimistic unchoke mechanism to an incentive based gossip streaming algorithm we can (still) distribute a stream from one source to n peers in O(log n) time with high probability. We provide simulation results for a distributed incentive scheme for gossip based p2...
متن کاملAnalysis and Implementation of Gossip-Based P2P Streaming with Distributed Incentive Mechanisms for Peer Cooperation
Peer-to-peer (P2P) systems are becoming a popular means of streaming audio and video content but they are prone to bandwidth starvation if selfish peers do not contribute bandwidth to other peers. We prove that an incentive mechanism can be created for a live streaming P2P protocol while preserving the asymptotic properties of randomized gossip-based streaming. In order to show the utility of o...
متن کاملPALMS : Reliable P2P Live Media Streaming
In recent year, Peer-to-Peer (P2P) approach for media streaming has been studied extensively. In comparison to on-demand media streaming, P2P live media streaming faces a much stringent time constraint. In order to improve the performance metrics, such as startup delay, source-to-end delay, and playback continuity, we present PALMS, a P2P approach for live media streaming where node employs gos...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کامل